Computer Algebra Style (Multiprecision) Interval and Complex Arithmetic

نویسندگان

  • Franky Backeljauw
  • Annie Cuyt
  • Johan Vervloet
چکیده

Using the approach in [2, 4, 5], interval bounds for values in R or R∪ [−∞, +∞], which is what one is interested in in most industrial applications, can be computed. These approaches, however, do not in all cases reflect all that is known about the interval valued expressions, as is required during prototyping or in a computer algebra environment. A similar remark holds for the complex arithmetic guidelines proposed in Annex G of the latest C programming language standard [1]. The approach is sufficiently correct when some additional background information is available about the evaluated expression. The lack of such information, however, may lead to the ambiguous interpretation of results. In the authors’ implementation, a more theoretical point of view on interval and complex arithmetic is proposed to tackle the above issue. It is natural, when taking a computer algebra style viewpoint, to deal not only with double precision, but also consider true higher precisions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Arithmetic in Multiprecision

Floating-point arithmetic precision is limited in length the IEEE single (respectively double) precision format is 32-bit (respectively 64-bit) long. Extended precision formats can be up to 128-bit long. However some problems require a longer floating-point format, because of round-off errors. Such problems are usually solved in arbitrary precision, but round-off errors still occur and must be ...

متن کامل

Efficient and Reliable Multiprecision Implementation of Elementary and Special Functions

Special functions are pervasive in all fields of science. The most well-known application areas are in physics, engineering, chemistry, computer science and statistics. Because of their importance several books and a large collection of papers have been devoted to the numerical computation of these functions. The technique to provide a floating-point implementation of a function differs substan...

متن کامل

ZKCM: a C++ library for multiprecision matrix computation with applications in quantum information

ZKCM is a C++ library developed for the purpose of multiprecision matrix computation, on the basis of the GNU MP and MPFR libraries. It provides an easy-to-use syntax and convenient functions for matrix manipulations including those often used in numerical simulations in quantum physics. Its extension library, ZKCM QC, is developed for simulating quantum computing using the time-dependent matri...

متن کامل

Reversible Karatsuba's Algorithm

Karatsuba discovered the first algorithm that accomplishes multiprecision integer multiplication with complexity below that of the grade-school method. This algorithm is implemented nowadays in computer algebra systems using irreversible logic. In this paper we describe reversible circuits for the Karatsuba’s algorithm and analyze their computational complexity. We discuss garbage disposal meth...

متن کامل

Multiprecision Translation and Execution of Fortran Programs

This paper describes two Fortran utilities for multiprecision computation. The first is a package of Fortran subroutines that perform a variety of arithmetic operations and transcendental functions on floating point numbers of arbitrarily high precision. This package is in some cases over 200 times faster than that of certain other packages that have been developed for this purpose. The second ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002